1 Divide and Conquer : Noisy Communication in Networks
نویسنده
چکیده
In a society composed of a ruler and its citizens: What are the determinants of the political equilibrium between these two? This paper approaches this problem as a game played between a ruler who has to decide the distribution of the aggregate income and a group of agents/citizens who have the opportunity to revolt if they are unhappy with the distribution. Nevertheless, if too few revolt, the agents become defeated and receive zero consumption, while a successful revolt increases the consumption level of the rebels whereas the ruler receives nothing. Coordinated action by citizens is possible because they form nodes in a communication network. However, communication through the network is noisy, which removes common knowledge about the endowments and could preclude the emergence of collective action among citizens. In this paper, I argue that the network structure and the noise level are determinants of the political equilibrium and wealth distribution. The model explains how the ruler could use propaganda, cooptation and repression to increase his expected utility. The formalization of the game is accomplished using such concepts as p-beliefs and p-dominant strategy (Monderer and Samet ,1989, and Morris and Shin, 2002). Finally, I illustrate the model by applying it to cases in Nigeria and Zaire/Congo.
منابع مشابه
Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملN -Graphs: A Topology for Parallel Divide-and-Conquer on Transputer Networks
A parallel implementation of a divide-and-conquer template (skeleton) is derived systematically from its functional speciication. The implementation makes use of a new processor topology for divide-and-conquer, called N-graph, which suits transputer networks well: there are not more than 4 links per processor, overlapping of computations and communication within a processor is exploited, the pr...
متن کاملPreliminary Result of Parallel Double Divide and Conquer
This paper shows a concept for parallelization of double Divide and Conquer and its preliminary result. For singular value decomposition, double Divide and Conquer was recently proposed. It first computes singular values by a compact version of Divide and Conquer. The corresponding singular vectors are then computed by twisted factorization. The speed and accuracy of double Divide and Conquer a...
متن کاملOn the effect of low-quality node observation on learning over incremental adaptive networks
In this paper, we study the impact of low-quality node on the performance of incremental least mean square (ILMS) adaptive networks. Adaptive networks involve many nodes with adaptation and learning capabilities. Low-quality mode in the performance of a node in a practical sensor network is modeled by the observation of pure noise (its observation noise) that leads to an unreliable measurement....
متن کاملDivide and Conquer - Organizing Component-based Adaptation in Distributed Environments
This paper introduces a divide and conquer approach for organizing the adaptation of distributed applications in a potentially large number of interacting middleware instances. In such an environment, a centralistic and static adaptation reasoning i) is inadequate and ii) gives the same priority to all applications. The divide and conquer method aims at minimizing the interference between runni...
متن کامل